Erratum to: Avoidable binary patterns in partial words
نویسندگان
چکیده
منابع مشابه
Squares in Binary Partial Words
In this paper, we investigate the number of positions that do not start a square, the number of square occurrences, and the number of distinct squares in binary partial words. Letting σh(n) be the maximum number of positions not starting a square for binary partial words with h holes of length n, we show that limσh(n)/n = 15/31 provided the limit of h/n is zero. Letting γh(n) be the minimum num...
متن کاملOn Avoidable Two Element Sets of Partial Words∗
This paper considers the problem of finding avoiding words given sets of partial words of the form {a 1a m2 . . . ka, b 1b n2 . . . lb} where a and b are letters in the alphabet and is a hole, or showing the set is unavoidable. Such a set is avoidable if and only if there exists a two-sided infinite full word with no factor compatible with a member of the set, and this word is called the avoidi...
متن کاملBinary patterns in binary cube-free words: Avoidability and growth
The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growt...
متن کاملCounting Binary Words Avoiding Alternating Patterns
Let F [p] denote the set of binary words, with no more 0’s than 1’s, that do not contain the pattern p = (10)1 as a factor for any fixed j ≥ 1. We give the generating function for the integer sequence enumerating, according to the number of 1’s, the words in F [p].
متن کاملGeneration of binary words avoiding alternating patterns
In this paper we propose an algorithm to generate binary words with no more 0’s than 1’s having a fixed number of 1’s and avoiding the pattern (10)1 for any fixed j ≥ 1. We will prove that this generation is exhaustive, that is, all such binary words are generated.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2011
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-011-0149-4